A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Karthikeyan, P.
- An Optimal Wake–up Scheduling Algorithm for Minimizing Energy Consumption While Limiting Maximum Delay in Mesh Sensor Network
Authors
1 Department of Information Technology, Anjalai Ammal Mahalingam Engineering College, Thiruvarur, Tamilnadu, IN
Source
Networking and Communication Engineering, Vol 3, No 11 (2011), Pagination: 706-710Abstract
A sensor network may contain huge number of simple sensor nodes that forms a mesh structure. The sensors also act as routers, forwarding packets from one of their neighbours to another. Sensors turn their communication hardware on and off to minimize energy consumption. In order for two neighbouring sensors to communicate, both must be in active mode. The wake-up frequency of a sensor depends on its location in the routing path. The optimum Wakeup frequency is calculated and controlled by an upper bound value and it must not exceed the threshold value. So that energy is minimized. The wake-up scheduling algorithm significantly increases the lifetime of the network and sensor while guaranteeing a maximum on the end to end delay. To transfer the packet without loss the beacon node is used. Using simulations, we show that the proposed algorithm significantly increases the lifetime of the network, while guaranteeing a maximum on the end-to-end delay.Keywords
Scheduling in Wireless Networks, Sensor Networks, Energy Consumption, Wakeup Frequency.
- Location Based Scheduler for Independent Jobs in Computational Grids
Authors
1 Department of Information Technology, King College of Technology, Namakkal, Tamilnadu, IN
2 Department of Computer Science and Engineering, King College of Technology, Namakkal, Tamilnadu, IN
Source
Networking and Communication Engineering, Vol 3, No 4 (2011), Pagination: 243-247Abstract
The job scheduling system is responsible to select est suitable machines in a grid for user jobs. The management scheduling system generates job schedules for each machine in the grid by taking static restrictions and dynamic parameters of jobs and machines into consideration. Very cumbersome in large grids and it determines efficiency of grid. In this paper, we propose a Location based scheduler for computational grids. Location based scheduler is used to the job according to the location of the system. In the location based scheduler the resource allocation are done in the globalscheduler and regional scheduler that is why average waiting time is reduced compare to the Non Location Based Scheduler. Proposed system reduces average waiting time and reduces the data traffic. Location based scheduler is claimed to be enhanced, scalable and dynamic. The considered methods have been tested under the grid simulator.